Relational Evaluation Schemes
نویسندگان
چکیده
We describe extensions to a scheme for evaluating parse selection accuracy based on named grammatical relations between lemmatised lexical heads. The scheme is intended to directly reflect the task of recovering grammatical and logical relations, rather than more arbitrary details of tree topology. There is a manually annotated test suite of 500 sentences which has been used by several groups to perform evaluations. We are developing software to create larger test suites automatically from existing treebanks. We are considering alternative relational annotations which draw a clearer distinction between grammatical and logical relations in order to overcome limitations of the current proposal.
منابع مشابه
A Performance Evaluation of Alternative Mapping Schemes for Storing XML Data in a Relational Database
XML is emerging as one of the dominant data formats for data processing on the Internet. To query XML data, query languages like XQL, Lorel, XML-QL, or XML-GL have been proposed. In this paper, we study how XML data can be stored and queried using a standard relational database system. For this purpose, we present alternative mapping schemes to store XML data in a relational database and discus...
متن کاملHybridation of Labeling Schemes for Efficient Dynamic Updates
With XML as the leading standard for data representation over the Web, it is crucial to store and query XML data. However, relational databases are the dominant database technology in most organizations. Thus, replacing relational database with a pure XML database is not a wise choice. One most prominent solution is to map XML into relational database. This paper introduces a robust labeling sc...
متن کاملDatabases and Temporal Constraints :
We continue the development of a theory of constraint databases with indeenite information which we originated in our previous research. Initially we review the schemes of L-constraint databases and indeenite L-constraint databases where L, the parameter, is a rst-order constraint language. Then we consider several instances of these schemes where L is a language for expressing information abou...
متن کاملHigher-order queries and applications
Higher-order transformations are ubiquitous within data management. In relational databases, higher-order queries appear in numerous aspects including query rewriting and query specification. In XML databases, higher-order functions are natural due to the close connection of XML query languages with functional programming. The thesis investigates higher-order query languages that combine higher...
متن کاملIntegrated Database Approach for Geodetic Applications* Integrated Database Approach for Geodetic Applications
INTEGRATED DATABASE APPROACH ..................... 3 Database Schemes and Instances ........................ 4 Data Models ................................. 6 THE ENTITY RELATIONSHIP MODEL ..................... 8 ER Schemes and ER Diagrams ......................... 12 Weak Entity Types .............................. 12 ER SCHEMES FOR THE SAMPLE GEODETIC APPLICATION .......... 13 TRANSLATING ER ...
متن کاملHOMES: A Higher-Order Mapping Evaluation System
We describe a system that integrates querying and query transformation in a single higher-order query language. The system allows users to write queries that integrate and combine query transformations. The power of higher-order functions also allows one to succinctly write complex relational queries. Our demonstration shows the utility of the system, explains the implementation architecture on...
متن کامل